Visualization of the Chaos Game for non-hyperbolic iterated function system
نویسندگان
چکیده
منابع مشابه
The chaos game on a general iterated function system
The main theorem of this paper establishes conditions under which the ‘chaos game’ algorithm almost surely yields the attractor of an iterated function system. The theorem holds in a very general setting, even for non-contractive iterated function systems, and under weaker conditions on the random orbit of the chaos game than obtained previously.
متن کاملChaotic property for non-autonomous iterated function system
In this paper, the new concept of non-autonomous iterated function system is introduced and also shown that non-autonomous iterated function system IFS(f_(1,∞)^0,f_(1,∞)^1) is topologically transitive for the metric space of X whenever the system has average shadowing property and its minimal points on X are dense. Moreover, such a system is topologically transitive, whenever, there is a point ...
متن کاملA Chaos game algorithm for generalized iterated function systems
In this paper we provide an extension of the classical Chaos game for IFSP. The paper is divided into two parts: in the first one, we discuss how to determine the integral with respect to a measure which is a combination of a self-similar measure from an IFSP along with a density given by an IFSM. In the second part, we prove a version of the Ergodic Theorem for the integration of a continuous ...
متن کاملThe Chaos Game on a General Iterated Function System from a Topological Point of View
We investigate combinatorial issues relating to the use of random orbit approximations to the attractor of an iterated function system with the aim of clarifying the role of the stochastic process during generation the orbit. A Baire category counterpart of almost sure convergence is presented; and a link between topological and probabilistic methods is observed.
متن کاملSimulation for chaos game representation of genomes by recurrent iterated function systems
some pattern (information) in the DNA sequence Chaos game representation (CGR) of DNA (Goldman 1993). Goldman (1993) interpreted the sequences and linked protein sequences CGRs in a biologically meaningful way. All points from genomes was proposed by Jeffrey (1990) plotted within a quadrant must corresponding to suban d Yu et al. (2004), respectively. In this sequences of the DNA sequence that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: REVISTA ODIGOS
سال: 2020
ISSN: 2697-3405
DOI: 10.35290/ro.v1n2.2020.302